Qué (quién) es peephole optimisation - definición
TYPE OF OPTIMIZATION
Robust optimisation
peephole optimisation
<compiler> A kind of code optimisation that considers only a
few adjacent instructions at a time and looks for certain
combinations which can be replaced with more efficient
sequences. E.g.
ADD R0, #1
ADD R0, #1
(add one to register R0) could be replaced by
ADD R0, #2
(1995-03-28)
Peephole optimization
COMPILER OPTIMIZATION TECHNIQUE
Peephole optimizations; Peephole optimizer; Peep hole optimizer; Peep hole optimizer'; Peep-hole optimizer; Peep-hole optimization
Peephole optimization is an optimization technique performed on a small set of compiler-generated instructions; the small set is known as the peephole or window.
Stochastic optimization
Stochastic search; Stochastic optimisation
Stochastic optimization (SO) methods are optimization methods that generate and use random variables. For stochastic problems, the random variables appear in the formulation of the optimization problem itself, which involves random objective functions or random constraints.
Wikipedia
Robust optimization
Robust optimization is a field of mathematical optimization theory that deals with optimization problems in which a certain measure of robustness is sought against uncertainty that can be represented as deterministic variability in the value of the parameters of the problem itself and/or its solution.
